منابع مشابه
Some (Fuzzy) Topologies on General\ Fuzzy Automata
In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a Lowen-type fuzzy topology on the set ofstates of a max- min general fuzzy automaton. Also by provingsome theorems, ...
متن کاملsome (fuzzy) topologies on general fuzzy automata
in this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. in fact, we obtain somelowen-type and chang-type fuzzy topologies on general fuzzyautomata. to this end, first we define a kuratowski fuzzy interioroperator which induces a lowen-type fuzzy topology on the set ofstates of a max- min general fuzzy automaton. also by provingsome theorems, ...
متن کاملSome Considerations on Fuzzy Conditional Inference
In much of human reasoning, the form of reasoning is approximate rather than exact as in "A red apple is ripe and this apple is more or less red. Then this apple is more or less ripe.' L.A. Zadeh and E.H. Mamdani suggested methods for such a fuzzy reasoning as an application of fuzzy set theory. The method involves an inference rule and a conditional proposition which contains fuzzy concepts. I...
متن کاملIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملSome Investigations in Fuzzy Automata Synopsis
Mathematical models in classical computation, automata have been an important area in theoretical computer science. It started from a seminal paper of Kleene, and within a few years developed into a rich mathematical research topic. From the very beginning finite automata constituted a core of computer science. Part of the reason is that they capture something very fundamental as is witnessed b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1969
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(69)80029-2